Computing transportation Voronoi diagrams in optimal time
نویسنده
چکیده
We present the first time-optimal algorithm for computing the Voronoi Diagram under the metric induced by a transportation network with discrete entry and exit points. For input with n sites, k stations, and e transportation lines, the algorithm computes the Voronoi Diagram in O ( (n+ k) log(n+ k) + e ) time.
منابع مشابه
Restricting Voronoi diagrams to meshes using corner validation
Restricted Voronoi diagrams are a fundamental geometric structure used in many applications such as surface reconstruction from point sets or optimal transport. Given a set of sites V = {vk}k=1 ⊂ R d and a mesh X with vertices in Rd connected by triangles, the restricted Voronoi diagram partitions X by computing for each site the portion of X for which the site is the nearest. The restricted Vo...
متن کاملVoronoi Diagrams for Polygon-Offset Distance Functions
In this paper we develop the concept of a polygon-ooset distance function and show how to compute the respective nearest-and furthest-site Voronoi diagrams of point sites in the plane. We provide optimal deterministic O(n(log n + log m) + m)-time algorithms, where n is the number of points and m is the complexity of the underlying polygon, for computing compact representations of both diagrams.
متن کاملI/O-Efficient Construction of Voronoi Diagrams∗
We consider the problems of computing 2and 3-d Voronoi diagrams for large data sets efficiently. We describe a cache-oblivious distribution data structure (buffer tree) that is the basis for the cache oblivious implementation of a random incremental construction for geometric problems. We then apply this to the construction of 2and 3-d Voronoi diagrams. We also describe a very simple variant of...
متن کاملAlgorithms for Complex Shapes with Certified Numerics and Topology Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
We present a general framework for computing two-dimensional Voronoi diagrams of different site classes under various distance functions. The computation of the diagrams employs the cgal software for constructing envelopes of surfaces in 3-space, which implements a divide-and-conquer algorithm. A straightforward application of the divide-and-conquer approach for Voronoi diagrams yields highly i...
متن کاملTravel Time Distances Induced by Transportation Networks and General Underlying Distances
This paper considers a generalization of travel time distances by taking general underlying distance functions into account. We suggest a reasonable set of axioms defining a certain class of distance functions that can be facilitated with transportation networks. It turns out to be able to build an abstract framework for computing shortest path maps and Voronoi diagrams with respect to the indu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005